Pipelining Extended Givens Rotation RLS Adaptive Filters
نویسندگان
چکیده
In this paper, we propose a new pipelining extended Givens Rotation Recursive Least Square (PEGR-RLS) architecture using look-ahead technique. The square-root-free forms of QRD-RLS are also difficult to pipeline. The PEGR-RLS algorithm (referred to as Scaled Tangent Rotation, STAR-RLS) is designed such that fine-grain pipelining can be accomplished with little hardware overhead. Similar to STAR-RLS, this algorithm is not exactly orthogonal transformations but tends to become orthogonal asymptotically. This algorithm also preserves the desired properties of the STAR-RLS algorithm. Specifically, it can be pipelined at very low forgetting factor by using extended look-ahead. Simulation results are presented to compare the performance of the STAR-RLS, QRD-RLS, and LMS algorithms.
منابع مشابه
Pipelined RLS adaptive architecture using relaxed Givens rotations (RGR)
In this paper, we focus on developing a new relaxed Givens rotations (RGR)-RLS algorithm and the corresponding RGR-RLS systolic array. The resulting algorithm and architecture possess fine-grain pipelining, nearly the same convergence as the QRD-RLS, good robustness for , and square-root free computation with a little area overhead.
متن کاملAnnihilation-reordering look-ahead pipelined CORDIC-based RLS adaptive filters and their application to adaptive beamforming
The novel annihilation-reordering look-ahead technique is proposed as an attractive technique for pipelining of Givens rotation (or CORDIC) based adaptive lters. Unlike the existing relaxed look-ahead, the annihilation-reordering look-ahead does not depend on the statistical properties of the input samples. It is an exact look-ahead and based on CORDIC arithmetic, which is known to be numerical...
متن کاملHigh - Speed Cordic Based Parallel Weight Extraction for Qrd-rls Adaptive Filtering
In this paper, a very high-speed Cordic based parallel weight extraction algorithm for QRD-RLS adaptive lter-ing is developed using the matrix lookahead technique. The algorithm is based on inverse updating and is pipelined at ne-grain level. The proposed architecture can be operated at arbitrarily high sample rates, and consists of only Givens rotations which can be mapped onto a Jacobi spe-ci...
متن کاملPipelined Cordic Based Qrd-rls Adaptive Filtering Using Matrix Lookahead
In this paper, the matrix lookahead transformation is developed to achieve ne-grain pipelining for Cordic based QRD-RLS adaptive ltering algorithm. Various implementation styles are proposed. They include pipelining, block processing, and incremental block processing. The proposed architectures can operate at arbitrarily high sample rates, and consist of only Givens and a few Gaussian rotations...
متن کاملIterative version of the QRD for adaptive RLS filtering
A modiied version of the QR{decomposition (QRD) is presented. It uses approximate Givens rotations instead of exact Givens rotations, i.e., a matrix entry usually annihilated with an exact rotation by an angle is only reduced by using an approximate rotation by an angle ~. The approximation of the rotations is based on the idea of CORDIC. Evaluating a CORDIC{based approximate rotation is to det...
متن کامل